Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
نویسندگان
چکیده
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some progress where the expected optimization time of EAs is analyzed rigorously. There are only three well-known problems of combinatorial optimization where such an approach has been performed for general input instances, namely minimum spanning trees, shortest paths, and maximum matchings. The theoretical results are asymptotic ones and several questions for realistic dimensions of the search space are open. We supplement the theoretical results by experimental ones. Many hypotheses are confirmed by rigorous statistical tests.
منابع مشابه
Maximizing Non-monotone/Non-submodular Functions by Multi-objective Evolutionary Algorithms
Evolutionary algorithms (EAs) are a kind of nature-inspired general-purpose optimization algorithm, and have shown empirically good performance in solving various real-word optimization problems. However, due to the highly randomized and complex behavior, the theoretical analysis of EAs is difficult and is an ongoing challenge, which has attracted a lot of research attentions. During the last t...
متن کاملFrom an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms
Almost all analyses of time complexity of evolutionary algorithms (EAs) have been conducted for (1 + 1) EAs only. Theoretical results on the average computation time of population-based EAs are few. However, the vast majority of applications of EAs use a population size that is greater than one. The use of population has been regarded as one of the key features of EAs. It is important to unders...
متن کاملAnalyzing Evolutionary Optimization in Noisy Environments
Many optimization tasks must be handled in noisy environments, where the exact evaluation of a solution cannot be obtained, only a noisy one. For optimization of noisy tasks, evolutionary algorithms (EAs), a type of stochastic metaheuristic search algorithm, have been widely and successfully applied. Previous work mainly focuses on the empirical study and design of EAs for optimization under no...
متن کاملAnalyses of evolutionary algorithms
Evolutionary algorithms (EAs) are a highly successful tool commonly used in practice to solve algorithmic problems. This remarkable practical value, however, is not backed up by a deep theoretical understanding. Such an understanding would facilitate the application of EAs to further problems. Runtime analyses of EAs are one way to expand the theoretical knowledge in this field. This thesis pre...
متن کاملیادگیری از جامعه مورچگان در بهینهسازی دیوارهای حائل بتنی
: In the present paper, lessons are learnt from ant society so that humankind can optimize his engineering issues. As an example of such issues, a reinforced concrete retaining wall for which the application of optimization can reduce the costs involved is considered. Traditional design procedure for reinforced concrete retaining walls is unable to design an optimized wall unless a large trial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004